Inverse Problems for Quantum Trees

نویسندگان

  • Sergei Avdonin
  • Pavel Kurasov
  • William Rundell
چکیده

Three different inverse problems for the Schrödinger operator on a metric tree are considered, so far with standard boundary conditions at the vertices. These inverse problems are connected with the matrix Titchmarsh-Weyl function, response operator (dynamic Dirichlet-to-Neumann map) and scattering matrix. Our approach is based on the boundary control (BC) method and in particular on the study of the response operator. It is proven that the response operator determines the quantum tree completely, i.e. its connectivity, lengths of the edges and potentials on them. The same holds if the response operator is known for all but one boundary points, as well as for the Titchmarsh-Weyl function and scattering matrix. If the connectivity of the graph is known, then the lengths of the edges and the corresponding potentials are determined by just the diagonal terms of the data.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Inverse Dynamical and Spectral Problems for the Wave and Schrödinger Equations on Finite Trees. the Leaf Peeling

Interest in inverse dynamical, spectral and scattering problems for differential equations on graphs is motivated by possible applications to nano-electronics and quantum waveguides and by a variety of other classical and quantum applications. Recently a new effective leaf peeling method has been proposed by S. Avdonin and P. Kurasov [3] for solving inverse problems on trees (graphs without cyc...

متن کامل

BQIABC: A new Quantum-Inspired Artificial Bee Colony Algorithm for Binary Optimization Problems

Artificial bee colony (ABC) algorithm is a swarm intelligence optimization algorithm inspired by the intelligent behavior of honey bees when searching for food sources. The various versions of the ABC algorithm have been widely used to solve continuous and discrete optimization problems in different fields. In this paper a new binary version of the ABC algorithm inspired by quantum computing, c...

متن کامل

The Study of Different Water Regimes on Photosynthetic Performance and Leaf Water Status of Pistachio Trees (Pistacia vera L.)

Water deficiency is one of the most important environmental stresses that limit plant growth and crop production. Measurement of chlorophyll fluorescence parameters is considered as an important indicator to evaluate the photosynthetic apparatus. In the present study, the effects of regulated water deficit, investigated in four water-regimes in pistachio orchard with 12-year-old trees of Akbari...

متن کامل

Combinatorial algorithms for inverse absolute 1-center location problems on trees

In an inverse network absolute (or vertex) 1-center location problem the parameters of a given network, like edge lengths or vertex weights, have to be modified at minimum total cost such that a prespecified vertex s becomes an absolute (or a vertex) 1-center of the network. In this article, the inverse absolute and vertex 1-center location problems on unweighted trees with n + 1 vertices are c...

متن کامل

On the inverse eigenvalue problems: the case of superstars

Let T be a tree and let x0 be a vertex of T . T is called a superstar with central vertex x0 if T − x0 is a union of paths. The General Inverse Eigenvalue Problem for certain trees is partially answered. Using this description, some superstars are presented for which the problem of ordered multiplicity lists and the Inverse Eigenvalue Problem are not equivalent.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007